Parallel Processing Letters on Optimal Orow-pram Algorithms for Computing Recursively Defined Functions
نویسنده
چکیده
Received (received date) Revised (revised date) Communicated by (Editor Name) ABSTRACT We investigate parallel algorithms to compute recursively deened functions. Our computational model are parallel random access machines (PRAM's). We preferably make use of the OROW-PRAM (owner read, owner write), a model supposed to be even weaker and more realistic than the EREW-PRAM (exclusive read, exclusive write) and that still provides the opportunities of a completely connected processor network. For OROW-PRAM's we show that our parallel algorithms are work-optimal.
منابع مشابه
On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions
Received (received date) Revised (revised date) Communicated by (Editor Name) ABSTRACT We investigate parallel algorithms to compute recursively deened functions. Our computational model are parallel random access machines (PRAM's). We preferably make use of the OROW-PRAM (owner read, owner write), a model supposed to be even weaker and more realistic than the EREW-PRAM (exclusive read, exclusi...
متن کاملParallel Algorithms for Maximum Subsequence and Maximum Subarray
Given a sequence Q of n numbers positive and negative the maximum subsequence of Q is the contiguous subsequence that has the maximum sum among all contiguous subsequences of Q Given a two dimensional array A of n n numbers positive and negative the maximum subarray of A is the contiguous subarray that has the maximum sum among all contiguous subarrays of A We present two O log n time parallel ...
متن کاملEfficient Parallel Algorithms for Template Matching
The parallel complexity of template matching has been well studied. In this paper we present more work-eÆcient algorithms than the existing ones. Our algorithms are based on FFT primitives. We consider the following models of computing: PRAM and the hypercube.
متن کاملSimple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
Two simple and work e cient parallel algorithms for the minimum spanning tree problem are presented Both algorithms perform O m log n work The rst algorithm runs in O log n time on an EREW PRAM while the second algorithm runs in O logn time on a Common CRCW PRAM
متن کاملSimple Linear Work Suffix Array Construction
A suffix array represents the suffixes of a string in sorted order. Being a simpler and more compact alternative to suffix trees, it is an important tool for full text indexing and other string processing tasks. We introduce the skew algorithm for suffix array construction over integer alphabets that can be implemented to run in linear time using integer sorting as its only nontrivial subroutin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995